Approximation algorithm - PDFSEARCH.IO - Document Search Engine

Approximation algorithm
Results: 454

#	Item
51	ALGO 2010 ATMOS/WAOA schedule THURSDAY 9 Sept:30 - 9:00 9:00 - 9:50 10::20 Add to Reading List Source URL: algo2010.csc.liv.ac.uk Language: English - Date: 2010-09-01 10:39:54 Operations research Approximation algorithm Computational complexity theory WAOA-FM Mathematical optimization Bin packing problem Mathematics Applied mathematics
52	Combinatorial Auctions with Restricted Complements Ittai Abraham Microsoft Research, Silicon Valley Moshe Babaioff Microsoft Research, Silicon Valley Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2012-04-26 10:21:18 Graph theory Mathematics Mechanism design Game theory Auctions Hypergraph Valuation VickreyClarkeGroves auction VickreyClarkeGroves mechanism Approximation algorithm Treewidth Optimization problem
53	Approximability Results for the p-Center Problem Stefan Buettcher Course Project Algorithm Design and Analysis Add to Reading List Source URL: stefan.buettcher.org Language: English - Date: 2004-09-19 21:38:52 Computational complexity theory Theory of computation Mathematics NP-complete problems Set cover problem NP Dominating set Approximation algorithm Metric k-center Optimization problem Reduction P versus NP problem
54	New Hardness Results for Diophantine Approximation Friedrich Eisenbrand & Thomas Rothvoß Institute of Mathematics EPFL, Lausanne Add to Reading List Source URL: www.math.washington.edu Language: English - Date: 2013-11-01 17:11:36 Computational complexity theory Diophantine approximation Approximation algorithm
55	A Compendium on Steiner Tree Problems Editors: M. Hauptmann and M. Karpinski Department of Computer Science and Add to Reading List Source URL: theory.cs.uni-bonn.de Language: English - Date: 2015-04-27 05:26:50 Computational complexity theory Graph theory Mathematics NP-complete problems Steiner tree problem Approximation algorithm APX Spanning tree Optimization problem Wiener connector Travelling salesman problem
56	Geoinformatica DOIs10707Task selection in spatial crowdsourcing from worker’s perspective Dingxiong Deng1 · Cyrus Shahabi1 · Add to Reading List Source URL: infolab.usc.edu Language: English - Date: 2016-05-21 03:16:43 Mathematics Graph theory Operations research Computational complexity theory Combinatorial optimization Mathematical optimization Travelling salesman problem Dynamic programming Algorithm Approximation algorithm Heterogeneous Earliest Finish Time Assignment problem
57	CS264: Beyond Worst-Case Analysis Lecture #15: Smoothed Complexity and Pseudopolynomial-Time Algorithms∗ Tim Roughgarden† November 5, 2014 Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2014-12-24 22:57:16 Computational complexity theory Theory of computation Operations research Complexity classes Combinatorial optimization Analysis of algorithms Knapsack problem Simplex algorithm Time complexity Optimization problem NP Polynomial-time approximation scheme
58	Overlays with preferences: Approximation algorithms for matching with preference lists Giorgos Georgiadis Department of Computer Science and Engineering Chalmers University of Technology SG¨oteborg, Sweden Add to Reading List Source URL: www.cse.chalmers.se Language: English - Date: 2011-05-18 09:50:44 Graph theory Mathematics Combinatorial optimization Computational complexity theory Routing algorithms Search algorithms Operations research Matching A* search algorithm Flow network
59	Simpler and Better Approximation Algorithms for Network Design Anupam Gupta∗ Amit Kumar† Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2005-11-30 21:17:11 Spanning tree NP-complete problems Routing algorithms Edsger W. Dijkstra Combinatorial optimization Steiner tree problem Minimum spanning tree Shortest path problem Eulerian path Algorithm Randomized algorithm Matching
60	Approximation Algorithms for Single and Multi-Commodity Connected Facility Location Fabrizio Grandoni & Thomas Rothvoß Department of Mathematics, M.I.T. Add to Reading List Source URL: www.math.washington.edu Language: English - Date: 2013-11-01 17:11:36 NP-complete problems Approximation algorithms Operations research Facility location problem Combinatorial optimization Steiner tree problem APX Draft:Sub-linear time algorithm Planar separator theorem